unweighted p-center problem on extended stars

Authors

jafar fathali

department of mathematics, shahrood university of technology, university blvd., shahrood, iran nader jafari rad

department of mathematics, shahrood university of technology, university blvd., shahrood, iran sadegh rahimi sherbaf

department of mathematics, shahrood university of technology, university blvd., shahrood, iran

abstract

an extended star is a tree which has only one vertex with degree larger than two. the -center problem in a graph  asks to find a subset  of the vertices of  of cardinality  such that the maximum weighted distances from  to all vertices is minimized. in this paper we consider the -center problem on the unweighted extended stars, and present some properties to find solution.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Unweighted p-center problem on extended stars

An extended star is a tree which has only one vertex with degree larger than two. The -center problem in a graph  asks to find a subset  of the vertices of  of cardinality  such that the maximum weighted distances from  to all vertices is minimized. In this paper we consider the -center problem on the unweighted extended stars, and present some properties to find solution.

full text

The P-Center Problem under Uncertainty

Facility location decisions play a prominent role in strategic planning of many firms, companies and governmental organizations. Since in many real-world facility location problems, the data are subject to uncertainty, in this paper, we consider the P-center problem under uncertainty of demands. Using Bertsimas and Sim approach, we develop a robust model of the problem as an integer programming...

full text

The P-Center Problem under Uncertainty

Facility location decisions play a prominent role in strategic planning of many firms, companies and governmental organizations. Since in many real-world facility location problems, the data are subject to uncertainty, in this paper, we consider the P-center problem under uncertainty of demands. Using Bertsimas and Sim approach, we develop a robust model of the problem as an integer programming...

full text

On a Generalization of the p-Center Problem

We study a generalization of the p{Center Problem, which we call the {Neighbor p{Center Problem (p{Center ()). Given a complete edge{ weighted network, the goal is to minimize the maximum distance of a client to its nearest neighbors in the set of p centers. We show that in general nding a O(2 poly(jV j)){approximation for p{ Center () is NP{hard, where jV j denotes the number of nodes in the n...

full text

On the single-assignment p-hub center problem

We study the computational aspects of the single-assignment p-hub center problem on the basis of a basic model and a new model. The new model's performance is substantially better in CPU time than di€erent linearizations of the basic model. We also prove the NP-Hardness of the problem. Ó 2000 Elsevier Science B.V. All rights reserved.

full text

My Resources

Save resource for easier access later


Journal title:
iranian journal of optimization

جلد ۶، شماره ۲، صفحات ۷۳۷-۷۴۴

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023